The structure of non-zero-sum stochastic games

The Structure of Non-zero-sum Stochastic Games

Strategies in a stochastic game are δ > 0 perfect if the induced one-stage games have certain δ equilibrium properties. Sufficient conditions are proven for the existence of δ perfect strategies for all δ > 0 implying the existence of equilibria for every > 0. Using this approach we prove the existence of equilibria for every > 0 for a special class of quitting games. The important technique of...

Definable Zero-Sum Stochastic Games

Definable zero-sum stochastic games involve a finite number of states and action sets, reward and transition functions that are definable in an o-minimal structure. Prominent examples of such games are finite, semi-algebraic or globally subanalytic stochastic games. We prove that the Shapley operator of any definable stochastic game with separable transition and reward functions is definable in...

Repeated Games Non - Zero - Sum of Incomplete

Non-Zero Sum Games for Reactive Synthesis

In this invited contribution [7], we summarize new solution concepts useful for the synthesis of reactive systems that we have introduced in several recent publications. These solution concepts are developed in the context of non-zero sum games played on graphs. They are part of the contributions obtained in the inVEST project funded by the European Research Council.

Non-zero-sum Dresher inspection games

An inspection game is here a non-cooperative two-person-game between an inspector and an inspectee. It models a situation where the inspector controls the inspectee who has an incentive to violate certain legal obligations. A recent survey of inspection games applied to data verification, for example in nuclear material safeguards, is given in [1]. Dresher [2] described a sequential inspection ...